翻訳と辞書 Words near each other ・ Two-Timing Touch and Broken Bones ・ Two-toed amphiuma ・ Two-toed Earless Skink ・ Two-toed sloth ・ Two-Toed Tom ・ Two-tone ・ Two-up ・ Two-up two-down ・ Two-variable logic ・ Two-vector ・ Two-way ・ Two-way alternating ・ Two-way analysis of variance ・ Two-way communication ・ Two-way contract ・ Two-way deterministic finite automaton ・ Two-way forward ・ Two-way indicator species analysis ・ Two-way radio ・ Two-way satellite time and frequency transfer ・ Two-way security ・ Two-way simultaneous ・ Two-way street ・ Two-Way Stretch ・ Two-way television ・ Two-wheel drive ・ Two-wheel tractor ・ Two-wheeler ・ Two-wheeler usage in Japan ・ Two-wire circuit Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Two-way deterministic finite automaton ： ウィキペディア英語版 Two-way deterministic finite automaton In computer science, in particular in automata theory, an automaton is called two-way if it is allowed to re-read its input. == Two-way deterministic finite automaton == A two-way deterministic finite automaton (2DFA) is an abstract machine, a generalized version of the deterministic finite automaton (DFA) which can revisit characters already processed. As in a DFA, there are a finite number of states with transitions between them based on the current character, but each transition is also labelled with a value indicating whether the machine will move its position in the input to the left, right, or stay at the same position. Equivalently, 2DFAs can be seen as read-only Turing machines with no work tape, only a read-only input tape. 2DFAs can be shown to have equivalent power to DFAs; that is, any formal language which can be recognized by a 2DFA can be recognized by a DFA which only examines and consumes each character in order. Since DFAs are obviously a special case of 2DFAs, this implies that both machines recognize precisely the set of regular languages. However, the equivalent DFA for a 2DFA may have exponentially more states, making 2DFAs a much more practical representation for algorithms for some common problems. They are also equivalent to read-only Turing machines that use only a constant amount of space on their work tape, since any constant amount of information can be incorporated into the finite control state via a product construction (a state for each combination of work tape state and control state). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Two-way deterministic finite automaton」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.